Combining message encryption and authentication
نویسندگان
چکیده
منابع مشابه
Combining message encryption and authentication
The first part of the paper explains the need for combining message encryption and authentication. We begin with the example to emphasize the fact that privacy does not imply authenticity. Then we prove, one needs both privacy and authenticity, even if one’s aim is just getting privacy. In the second part we present an overview of different methods for providing authenticated encryption (AE) i....
متن کاملInteractive Encryption and Message Authentication
Public-Key Encryption (PKE) and Message Authentication (PKMA, aka as digital signatures) are fundamental cryptographic primitives. Traditionally, both notions are defined as non-interactive (i.e., single-message). In this work, we initiate rigorous study of (possibly) interactive PKE and PKMA schemes. We obtain the following results demonstrating the power of interaction to resolve questions wh...
متن کاملMessage Encryption and Authentication Using One-Way Hash Functions
A one-way hash function is an important cryptographic primitive for digital signatures and authentication. Recently much work has been done toward construction of other cryptographic algorithms (e.g., MACs) using hash functions. In particular, such algorithms would be easy to implement with existing codes of hash functions if they are used as a black box without modiication. In this paper we pr...
متن کاملA secure media streaming mechanism combining encryption, authentication, and transcoding
Technology advancements are allowing more and more new media applications and services to be delivered over the Internet. Many of these applications and services require flexibility in media distribution as well as security in protecting the confidentiality of media content and ensuring its authenticity. However, achieving flexibility and achieving security are conventionally conflicting with e...
متن کامل(Hierarchical) Identity-Based Encryption from Affine Message Authentication
In this talk, we provide a generic transformation from any affine message authentication code (MAC) to an identity-based encryption (IBE) scheme over pairing groups of prime order. If the MAC satisfies a security notion related to unforgeability against chosen-message attacks and, for example, the k-Linear assumption holds, then the resulting IBE scheme is adaptively secure. Our security reduct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales UMCS, Informatica
سال: 2011
ISSN: 2083-3628,1732-1360
DOI: 10.2478/v10065-011-0010-y